A Reduction Algorithm for Algebraic Function Fields
نویسندگان
چکیده
Computer algebra systems often produce large expressions involving complicated algebraic numbers. In this paper we study variations of the polred algorithm that can often be used to find better representations for algebraic numbers. The main new algorithm presented here is an algorithm that treats the same problem for the function field case.
منابع مشابه
HYPERTRANSCENDENTAL FORMAL POWER SERIES OVER FIELDS OF POSITIVE CHARACTERISTIC
Let $K$ be a field of characteristic$p>0$, $K[[x]]$, the ring of formal power series over $ K$,$K((x))$, the quotient field of $ K[[x]]$, and $ K(x)$ the fieldof rational functions over $K$. We shall give somecharacterizations of an algebraic function $fin K((x))$ over $K$.Let $L$ be a field of characteristic zero. The power series $finL[[x]]$ is called differentially algebraic, if it satisfies...
متن کاملComputing Riemann-Roch Spaces in Algebraic Function Fields and Related Topics
We develop a simple and e cient algorithm to compute Riemann-Roch spaces of divisors in general algebraic function elds which does not use the Brill-Noether method of adjoints nor any series expansions. The basic idea also leads to an elementary proof of the Riemann-Roch theorem. We describe the connection to the geometry of numbers of algebraic function elds and develop a notion and algorithm ...
متن کاملResearch Statement and Plan
My main research interest is number theory, in particular algebraic and computational number theory. Specifically, I am interested in computational aspects of number fields and function fields, in particular field tabulation and efficient computation of invariants associated with number fields and function fields. Many problems in this area have been explored extensively in the case of number f...
متن کاملAlgebraic Extensions for Symbolic Summation
The main result of this thesis is an effective method to extend Karr’s symbolic summation framework to algebraic extensions. These arise, for example, when working with expressions involving (−1)n. An implementation of this method, including a modernised version of Karr’s algorithm is also presented. Karr’s algorithm is the summation analogue of the Risch algorithm for indefinite integration. I...
متن کاملIdeal forms of Coppersmith's theorem and Guruswami-Sudan list decoding
We develop a framework for solving polynomial equations with size constraints on solutions. We obtain our results by showing how to apply a technique of Coppersmith for finding small solutions of polynomial equations modulo integers to analogous problems over polynomial rings, number fields, and function fields. This gives us a unified view of several problems arising naturally in cryptography,...
متن کامل